An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles
نویسندگان
چکیده
منابع مشابه
Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملParallel Inexact Newton and Interior Point Method
In this paper we present the results obtained in the solution of sparse and large systems of non-linear equations by inexact Newton methods combined with an block iterative row-projection linear solver of Cimmino-type. Moreover, we propose a suitable partitioning of the Jacobian matrix A. In view of the sparsity, we obtain a mutually orthogonal row-partition of A that allows a simple solution o...
متن کاملAn inexact interior-point method for system analysis
(Rece;"cd 00 Monlh 20Ox; final ...,rsiaH recei"ed 00 Monlh £OOX) In this paper a primal-dual interior-point algorithm for semidefinite programming that can be used for analrzing e.g_ polytopic linear difleTential indusions is tailored in order to be more computationally efficient. The key to th" speedup is to allow for inexact ..,,,rch directions in the inteciOT_point algorithm. Th.,..., are ob...
متن کاملOn the Implementation of an Interior-Point Algorithm for Nonlinear Optimization with Inexact Step Computations
This paper describes a practical implementation of a line-search interiorpoint algorithm for large-scale nonlinear optimization. It is based on the algorithm proposed by Curtis, Schenk, and Wächter [SIAM J. Sci. Comput., 32 (2010), pp. 3447-3475], a method that possesses global convergence guarantees to first-order stationary points with the novel feature that inexact search direction calculati...
متن کاملAn Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses iterative linear system solvers. Inexact step computations are supported in order to save computational expense during each iteration. The algorithm is an interior-point approach derived from an inexact Ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2020
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-020-01680-3